翻訳と辞書 Words near each other ・ Adma ・ Adma (motorcycle) ・ Adma, Lebanon ・ Adma, West Virginia ・ Admah ・ Admannshagen-Bargeshagen ・ ADMAR ・ AdMarketplace ・ Admas University College ・ Admas University College–Addis Ababa ・ Admas University College–Garowe ・ Adlawan ・ Adldorf ・ Adlecti ・ Adleman ・ Adleman–Pomerance–Rumely primality test ・ Adlen Griche ・ Adlene Harrison ・ Adler ・ Adler & Sullivan ・ Adler (automobile) ・ Adler (band) ・ Adler (comics) ・ Adler (disambiguation) ・ Adler (locomotive) ・ Adler 2 Liter ・ Adler 2.5-litre ・ Adler and Allan ・ Adler Apotheke ・ Adler Apotheke (Dortmund) Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Adleman–Pomerance–Rumely primality test ： ウィキペディア英語版 Adleman–Pomerance–Rumely primality test In computational number theory, the Adleman–Pomerance–Rumely primality test is an algorithm for determining whether a number is prime. Unlike other, more efficient algorithms for this purpose, it avoids the use of random numbers, so it is a deterministic primality test. It is named after its discoverers, Leonard Adleman, Carl Pomerance, and Robert Rumely. The test involves arithmetic in cyclotomic fields. It was later improved by Henri Cohen and Hendrik Willem Lenstra, commonly referred to as APR-CL. It can test primality of an integer ''n'' in time: : $O((\backslash ln\; n)^).$ == Software implementations == * UBASIC provides an implementation under the name APRT-CLE (APR Test CL extended) *A (factoring applet ) that uses APR-CL on certain conditions (source code included) *(Pari/GP ) uses APR-CL conditionally in its implementation of isprime(). *(mpz_aprcl ) is an open source implementation using C + GMP. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Adleman–Pomerance–Rumely primality test」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.